Nonexistence of face-to-face four-dimensional tilings in the Lee metric

نویسنده

  • Simon Spacapan
چکیده

A family of n-dimensional Lee spheres L is a tiling of Rn , if ∪L = Rn and for every Lu , Lv ∈ L, the intersection Lu ∩ Lv is contained in the boundary of Lu . If neighboring Lee spheres meet along entire (n−1)-dimensional faces, then L is called a face-to-face tiling. We prove the nonexistence of a face-to-face tiling of R4 with Lee spheres of different radii. c © 2005 Elsevier Ltd. All rights reserved. MSC: 52C22; 94B60; 68R05

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tilings in Lee metric

Gravier et al. proved [S. Gravier, M. Mollard, Ch. Payan, On the existence of three-dimensional tiling in the Lee metric, European J. Combin. 19 (1998) 567–572] that there is no tiling of the three-dimensional space R3 with Lee spheres of radius at least 2. In particular, this verifies the Golomb–Welch conjecture for n = 3. Špacapan, [S. Špacapan, Non-existence of face-to-face four-dimensional ...

متن کامل

Supervised Feature Extraction of Face Images for Improvement of Recognition Accuracy

Dimensionality reduction methods transform or select a low dimensional feature space to efficiently represent the original high dimensional feature space of data. Feature reduction techniques are an important step in many pattern recognition problems in different fields especially in analyzing of high dimensional data. Hyperspectral images are acquired by remote sensors and human face images ar...

متن کامل

Tiling Three-space by Combinatorially Equivalent Convex Polytopes

The paper settles a problem of Danzer, Griinbaum, and Shephard on tilings by convex polytopes. We prove that, for a given three-dimensional convex polytope P, there is a locally finite tiling of the Euclidean three-space by convex polytopes each combinatorially equivalent to P. In general, face-to-face tilings will not exist.

متن کامل

Cube Tilings of R and Nonlinear Codes

Families of non-lattice tilings of R by unit cubes are constructed. These tilings are specializations of certain families of nonlinear codes over GF( 2 ). These cube-tilings provide building blocks for the construction of cube-tilings such that no two cubes have a high-dimensional face in common. We construct cube-tilings of R such that no two cubes have a common face of dimension exceeding n −...

متن کامل

Cube-Tilings of Rn and Nonlinear Codes

Families of non-lattice tilings of R n by unit cubes are constructed. These tilings are specializations of certain families of nonlinear codes over GF( 2 ). These cube-tilings provide building blocks for the construction of cube-tilings such that no two cubes have a high-dimensional face in common. We construct cube-tilings of R n such that no two cubes have a common face of dimension exceeding...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Eur. J. Comb.

دوره 28  شماره 

صفحات  -

تاریخ انتشار 2007